SPAligner: alignment of long diverged molecular sequences to assembly graphs
نویسندگان
چکیده
منابع مشابه
Clustering of Short Read Sequences for de novo Transcriptome Assembly
Given the importance of transcriptome analysis in various biological studies and considering thevast amount of whole transcriptome sequencing data, it seems necessary to develop analgorithm to assemble transcriptome data. In this study we propose an algorithm fortranscriptome assembly in the absence of a reference genome. First, the contiguous sequencesare generated using de Bruijn graph with d...
متن کاملAn investigation of Hebbian phase sequences as assembly graphs
Hebb proposed that synapses between neurons that fire synchronously are strengthened, forming cell assemblies and phase sequences. The former, on a shorter scale, are ensembles of synchronized cells that function transiently as a closed processing system; the latter, on a larger scale, correspond to the sequential activation of cell assemblies able to represent percepts and behaviors. Nowadays,...
متن کاملLong-lasting molecular alignment: fact or fiction?
It has been suggested that appropriate periodic sequences of laser pulses can maintain molecular alignment for arbitrarily long times [J. Ortigoso, Phys. Rev. Lett. 93, 073001 (2004)]. These aligned states are found among the cyclic eigenstates of truncated matrix representations of the one-period time propagator U(T,0). However, long time localization of periodic driven systems depends on the ...
متن کاملGlobal Alignment of Molecular Sequences via Ancestral State Reconstruction
Molecular phylogenetic techniques do not generally account for such common evolutionary events as site insertions and deletions (known as indels). Instead tree building algorithms and ancestral state inference procedures typically rely on substitution-only models of sequence evolution. In practice these methods are extended beyond this simplified setting with the use of heuristics that produce ...
متن کاملA local alignment tool for very long DNA sequences
This paper presents a practical program, called sim2, for building local alignments of two sequences, each of which may be hundreds of kilobases long. sim2 first constructs n best non-intersecting chains of 'fragments', such as all occurrences of identical 5-tuples in each of two DNA sequences, for any specified n > or = 1. Each chain is then refined by delivering an optimal alignment in a regi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2020
ISSN: 1471-2105
DOI: 10.1186/s12859-020-03590-7